On Load Balancing in Erlang Networks

The dynamic resource allocation problem arises in a variety of applications The generic resource allocation setting involves a number of locations containing resources The dynamic aspect of the problem is the arrivals of consumers each of which requires a certain amount of service from the resources and the control variable of the problem is the allocation policy which speci es at which location each consumer is to be served Oftentimes in applications locations contain nitely many resources hence the main objective of the allocation policy is to guarantee low blocking probability On the other hand in some applications such as spread spectrum mobile radio networks there are no sharp capacity constraints and the goal becomes to dynamicallybalance the load In either case one wants the allocation policy to have low complexity require little information about the system state and be robust to changes in the tra c parameters An instance of resource allocation arises in the wireless network pictured in Figure The network consists of a number of base stations and users The users require communication channels that are available at the base stations whereas each station may serve the users within its geographical range The resource allocation problem in this setting concerns the question of station se lection Load balancing is a possible guiding principle for resource allocation whereby the load is allocated across locations as evenly as possible It is well known that load balancing can be an e ective allocation strategy when the cost is convex or the reward concave as a function of the allocated loads For example x y z